|
|
Visibility Determination in 3D Maze
Hodes, Vít ; Pečiva, Jan (referee) ; Polok, Lukáš (advisor)
This work is about solving the visibility problem in the environment of simple 3D maze by means of BSP tree and PVS computation between leaves. It contains description of key algorithms and processes for achieving this goal. In the core of this work were all of the implemented ways of drawing measured and mutually compared. At the end are outlined next possible steps in development and evaluating achieved results.
|
|
|
Music information retrieval techniques for determining the place of origin of the Czech chamber and orchestral music interpretations
Miklánek, Štěpán ; Mekyska, Jiří (referee) ; Kiska, Tomáš (advisor)
This diploma thesis is focused on the statistical analysis of chamber and orchestral classical music recordings composed by Czech authors. One of the chapters is dedicated to the description of a feature extraction process that precedes the statistical analysis. Techniques of Music Information Retrieval are used during several stages of this thesis. Databases used for analysis are described and pre-processing steps are proposed. A tool for synchronization of the recordings was implemented in MATLAB. Finally the system used for classification of recordings based on their geographical origin is proposed. The recordings are sorted by a binary classifier into two categories of Czech and world recordings. The first part of the statistical analysis is focused on individual analysis of features. The features are evaluated based on their discrimination strength. The second part of the statistical analysis is focused on feature selection, which can improve the overall accuracy of the binary classifier compared to the individual analysis of the features.
|
|
|
Basic fingerprint liveness detection
Horák, Tomáš ; Smital, Lukáš (referee) ; Kašpar, Jakub (advisor)
Biometric data is unique, safe and often used to protect information. Even in some cases, detectors can be fooled, and therefore liveness is needed to check. This work focuses on the basic recognition of the liveliness of the fingerprint. Only one finger image is used. For perfect recognition, you need to compare the prints, so have more than one print, and that's why this detection is very demanding. Pre-processing was done with a binary segmentation mask. Methods using gray scale ratios, mean, standard deviations or histogram equalization were also used. All the methods were done on the LivDet 2011 database, in the Matlab environment and the goal was to recognize a live fingerprints from a false ones.
|
|
|
Basic fingerprint liveness detection
Horák, Tomáš ; Smital, Lukáš (referee) ; Kašpar, Jakub (advisor)
This work focuses on recognizing fingerprints liveness based purely on software-methods evaluating symptoms from just one fingerprint image. At first in this work was described the issue of biometry as such, comparing the advantages and disadvantages of such systems. Next part deal with more detailed process of fingerprint biometry including papillary lines and overall fingerprints as such. In the next phase, the problems and utilization of both software and hardware methods are discussed, including principles of individual approaches. This part is followed by a selection of used fingertip symptoms. This is followed by the practical part and the LivDet 2011 database, which was used for finger recognition. In the practical part is also described the used neural network capturing minor differences in fingerprints according to 13 symptoms.
|
|
|
Automatic smoothing 3D models of cranial embryonic mouse cartilage
Kočendová, Kateřina ; Harabiš, Vratislav (referee) ; Jakubíček, Roman (advisor)
The focus of this thesis is the smoothing of manually segmented 3D models of mouse embryo craniofacial cartilege. During the process of manual segmentation, artefacts and other imperfections appear in the final models and need to be repaired. Firstly, manual segmentation is corrected using gradients and thresholding. Subsequent smoothing methods are constructed based on theoretical research. Algorithmizing is executed in the MATLAB environment. All the designed algorithms are then tested on selected models. Statistical evaluation is determined using the Srensen–Dice coefficient, where manually smoothened models cleared of all artefacts are used as the gold standard.
|
|
|
Recognition of music cover versions using Music Information Retrieval techniques
Martinek, Václav ; Zvončák, Vojtěch (referee) ; Kiska, Tomáš (advisor)
This master’s thesis deals with designs and implementation of systems for music cover recognition. The introduction part is devoted to the calculation parameters from audio signal using Music Information Retrieval techniques. Subsequently, various forms of cover versions and musical aspects that cover versions share are defined. The thesis also deals in detail with the creation and distribution of a database of cover versions. Furthermore, the work presents methods and techniques for comparing and processing the calculated parameters. Attention is then paid to the OTI method, CSM calculation and methods dealing with parameter selection. The next part of the thesis is devoted to the design of systems for recognizing cover versions. Then there are compared systems already designed for recognizing cover versions. Furthermore, the thesis describes machine learning techniques and evaluation methods for evaluating the classification with a special emphasis on artificial neural networks. The last part of the thesis deals with the implementation of two systems in MATLAB and Python. These systems are then tested on the created database of cover versions.
|
|
|
Error protection of data transmission using BCH Codes
Kašpar, Jaroslav ; Křivánek, Vítězslav (referee) ; Němec, Karel (advisor)
The thesis Data transmission error-protection with BCH codes deals with a large class of random-error correcting cyclic codes which are able to protect binary data and can be used for example in data storages, high speed modems. Bose, Chaudhuri and Hocquenghem (BCH) codes operate over algebraic structures called Galois fields. The BCH encoding is the same as cyclic encoding and can be done with linear feedback shift register but decoding is more complex and can be done with different algorithms - in this thesis there are two algorithms for decoding Peterson and Berlekam-Massey mentioned. The aim of this thesis is to find BCH code which is able to correct t = 6 independent errors in up to data sequence n = 150 bits, then peruse possible realizations of the codecs and set criteria for the best realization, then design and test this realization. This thesis is split into three main parts. In the first part there are encoding and decoding methods of the BCH code generally described. The second part deals with selecting of the right code and realization. There was chosen BCH (63,30) code and realization with FPGA chip. In the last part is described design of BCH encoder and decoder and compilation in the Altera design software.
|
|
|
Searching algorithms
Ďuriš, Martin ; Šeda, Miloš (referee) ; Dvořák, Jiří (advisor)
The thesis describes and analyzes selected searching algorithms for single dimensional array. Algorithms are analyzed mathematically and graphically. Mathematical analysis is based on analysis of average amount of performed comparisons required for the final result and literature review. Graphical analysis is based on multiple examinations of selected searching methods with randomly generated single dimensional arrays. The graphs show dependency of elapsed searching time of successful and unsuccessful searching trial on the size of single dimensional array. The results establish the binary searching algorithm as the fastest one of the selected searching algorithms.
|
|
|
Dynamical perturbations of triple stellar and planetary systems seen in gravitational waves with LISA
Mezera, Matěj ; Pejcha, Ondřej (advisor) ; Švarc, Robert (referee)
We study gravitational waves from a binary system that is perturbed by the presence of a distant third body. We present three representative models of the hierarchical triple system and we numerically model the gravitational waveform. The motion of the bodies is simulated in the Newtonian approximation on a long timescale so that Lidov-Kozai oscillation can occur. This oscillation causes periodic exchange between relative incli- nation and eccentricity of the inner binary. We analyze the frequency spectrum of the waveform and identify the effect of perturbations on a timescale similar to the binary orbital period Tin, perturbations related to the orbital period of the third body Tout, and Lidov-Kozai cycles with an approximate period T2 out/Tin. It is expected that the upcoming space detector LISA (Laser Interferometer Space Antenna) will be able to detect these gravitational signals and it will be possible to derive information about the triple system from the waveform. 1
|
|
|
Recognition of music cover versions using Music Information Retrieval techniques
Martinek, Václav ; Zvončák, Vojtěch (referee) ; Kiska, Tomáš (advisor)
This master’s thesis deals with designs and implementation of systems for music cover recognition. The introduction part is devoted to the calculation parameters from audio signal using Music Information Retrieval techniques. Subsequently, various forms of cover versions and musical aspects that cover versions share are defined. The thesis also deals in detail with the creation and distribution of a database of cover versions. Furthermore, the work presents methods and techniques for comparing and processing the calculated parameters. Attention is then paid to the OTI method, CSM calculation and methods dealing with parameter selection. The next part of the thesis is devoted to the design of systems for recognizing cover versions. Then there are compared systems already designed for recognizing cover versions. Furthermore, the thesis describes machine learning techniques and evaluation methods for evaluating the classification with a special emphasis on artificial neural networks. The last part of the thesis deals with the implementation of two systems in MATLAB and Python. These systems are then tested on the created database of cover versions.
|
guest ::
